- equivalent normal form
- эквивалентная нормальная форма, ЭНФ (форма представления булевой функции, реализуемой комбинационной схемой); см. также ENF
Англо-русский словарь промышленной и научной лексики. 2014.
Англо-русский словарь промышленной и научной лексики. 2014.
Prenex normal form — A formula of the predicate calculus is in prenex[1] normal form if it is written as a string of quantifiers followed by a quantifier free part (referred to as the matrix). Every formula in classical logic is equivalent to a formula in prenex… … Wikipedia
Conjunctive normal form — In Boolean logic, a formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals. As a normal form, it is useful in automated theorem proving. It is similar to the product of sums form … Wikipedia
Jordan normal form — In linear algebra, a Jordan normal form (often called Jordan canonical form)[1] of a linear operator on a finite dimensional vector space is an upper triangular matrix of a particular form called Jordan matrix, representing the operator on some… … Wikipedia
Clausal normal form — The clausal normal form (or clause normal form, conjunctive normal form, CNF) of a logical formula is used in logic programming and many theorem proving systems. A formula in clause normal form is a set of clauses, interpreted as a conjunction. A … Wikipedia
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
Smith normal form — The Smith normal form is a normal form that can be defined for any matrix (not necessarily square) with entries in a principal ideal domain (PID). The Smith normal form of a matrix is diagonal, and can be obtained from the original matrix by… … Wikipedia
Chomsky normal form — In computer science, a context free grammar is said to be in Chomsky normal form if all of its production rules are of the form: or or where A, B and C are nonterminal symbols, α is a terminal symbol (a symbol that represents a constant value), S … Wikipedia
Third normal form — The third normal form (3NF) is a normal form used in database normalization. 3NF was originally defined by E.F. CoddCodd, E.F. Further Normalization of the Data Base Relational Model. (Presented at Courant Computer Science Symposia Series 6, Data … Wikipedia
Greibach normal form — In computer science, to say that a context free grammar is in Greibach normal form (GNF) means that all production rules are of the form::A o alpha X or:S o lambdawhere A is a nonterminal symbol, α is a terminal symbol, X is a (possibly empty)… … Wikipedia
normal — /ˈnɔməl / (say nawmuhl) adjective 1. conforming to the standard or the common type; regular, usual, natural, or not abnormal: the normal procedure. 2. serving to fix a standard. 3. Psychology a. approximately average in respect to any… …
normal — nor•mal [[t]ˈnɔr məl[/t]] adj. 1) conforming to the standard or the common type; usual; regular; natural 2) serving to fix a standard 3) cvb bio med of natural occurrence 4) psi approximately average in any psychological trait, as intelligence,… … From formal English to slang